Soft image segmentation by weighted linked pyramid

This paper describes the use of weighted linked pyramid algorithms to achieve soft segmentation of images. A fundamental problem of region segmentation is that for many images no unique, correct region boundaries can be determined. In this situation the normal desire for a deenitive crisp segmentation may be unreasonable. It is proposed that soft segmentation is a more natural way to segment digital image data than crisp segmen-tation. A method of deriving a soft segmentation from a weighted linked pyramid is shown. We introduce methods for comparing a soft segmenta-tion with a crisp one and show that in some ways the soft segmentation is better.